Qualitative Fuzzy Sets and Granular Computing
نویسنده
چکیده
A real world fuzzy set should be able to tolerate ”small amounts” of perturbations. In type II fuzzy set represents each grade is represented by a fuzzy number. In other words, each grade may be perturbed independently. Such an ”independent perturbation” is inadequate, when a membership function is required to be continuous, differentiable, and etc. Pointwise perturbation cannot guarantee the continuity and differentiability of ”intermediate membership functions” during the perturbation. So we take the approach that requires ”simultaneous” perturbation at each grade.
منابع مشابه
SYSTEM MODELING WITH FUZZY MODELS: FUNDAMENTAL DEVELOPMENTS AND PERSPECTIVES
In this study, we offer a general view at the area of fuzzy modeling and fuzzymodels, identify the visible development phases and elaborate on a new and promisingdirections of system modeling by introducing a concept of granular models. Granularmodels, especially granular fuzzy models constitute an important generalization of existingfuzzy models and, in contrast to the existing models, generat...
متن کاملUncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space
Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...
متن کاملGranular Computing using Neighborhood Systems
A set-theoretic framework is proposed for granular computing. Each element of a universe is associated with a nonempty family of neighborhoods. A neighborhood of an element consists of those elements that are drawn towards that element by indistinguishability, similarity, proximity, or functionality. It is a granule containing the element. A neighborhood system is a family of granules, which is...
متن کاملINTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کامل